Method and apparatus for vector index load and store

ABSTRACT

An apparatus and method for performing vector index loads and stores. For example, one embodiment of a processor comprises: a vector index register to store a plurality of index values; a mask register to store a plurality of mask bits; a vector register to store a plurality of vector data elements loaded from memory; and vector index load logic to identify an index stored in the vector index register to be used for a load operation using an immediate value and to responsively combine the index with a base memory address to determine a memory address for the load operation, the vector index load logic to load vector data elements from the memory address to the vector register in accordance with the plurality of mask bits.

BACKGROUND

1. Field of the Invention

This invention relates generally to the field of computer processors.More particularly, the invention relates to a method and apparatus for avector index load and store.

2. Description of the Related Art

An instruction set, or instruction set architecture (ISA), is the partof the computer architecture related to programming, including thenative data types, instructions, register architecture, addressingmodes, memory architecture, interrupt and exception handling, andexternal input and output (I/O). It should be noted that the term“instruction” generally refers herein to macro-instructions—that isinstructions that are provided to the processor for execution—as opposedto micro-instructions or micro-ops—that is the result of a processor'sdecoder decoding macro-instructions. The micro-instructions or micro-opscan be configured to instruct an execution unit on the processor toperform operations to implement the logic associated with themacro-instruction.

The ISA is distinguished from the microarchitecture, which is the set ofprocessor design techniques used to implement the instruction set.Processors with different microarchitectures can share a commoninstruction set. For example, Intel® Pentium 4 processors, Intel® Core™processors, and processors from Advanced Micro Devices, Inc. ofSunnyvale Calif. implement nearly identical versions of the x86instruction set (with some extensions that have been added with newerversions), but have different internal designs. For example, the sameregister architecture of the ISA may be implemented in different ways indifferent microarchitectures using well-known techniques, includingdedicated physical registers, one or more dynamically allocated physicalregisters using a register renaming mechanism (e.g., the use of aRegister Alias Table (RAT), a Reorder Buffer (ROB) and a retirementregister file). Unless otherwise specified, the phrases registerarchitecture, register file, and register are used herein to refer tothat which is visible to the software/programmer and the manner in whichinstructions specify registers. Where a distinction is required, theadjective “logical,” “architectural,” or “software visible” will be usedto indicate registers/files in the register architecture, whiledifferent adjectives will be used to designate registers in a givenmicroarchitecture (e.g., physical register, reorder buffer, retirementregister, register pool).

An instruction set includes one or more instruction formats. A giveninstruction format defines various fields (number of bits, location ofbits) to specify, among other things, the operation to be performed andthe operand(s) on which that operation is to be performed. Someinstruction formats are further broken down though the definition ofinstruction templates (or subformats). For example, the instructiontemplates of a given instruction format may be defined to have differentsubsets of the instruction format's fields (the included fields aretypically in the same order, but at least some have different bitpositions because there are less fields included) and/or defined to havea given field interpreted differently. A given instruction is expressedusing a given instruction format (and, if defined, in a given one of theinstruction templates of that instruction format) and specifies theoperation and the operands. An instruction stream is a specific sequenceof instructions, where each instruction in the sequence is an occurrenceof an instruction in an instruction format (and, if defined, a given oneof the instruction templates of that instruction format).

BRIEF DESCRIPTION OF THE DRAWINGS

A better understanding of the present invention can be obtained from thefollowing detailed description in conjunction with the followingdrawings, in which:

FIGS. 1A and 1B are block diagrams illustrating a generic vectorfriendly instruction format and instruction templates thereof accordingto embodiments of the invention;

FIG. 2A-D is a block diagram illustrating an exemplary specific vectorfriendly instruction format according to embodiments of the invention;

FIG. 3 is a block diagram of a register architecture according to oneembodiment of the invention; and

FIG. 4A is a block diagram illustrating both an exemplary in-orderfetch, decode, retire pipeline and an exemplary register renaming,out-of-order issue/execution pipeline according to embodiments of theinvention;

FIG. 4B is a block diagram illustrating both an exemplary embodiment ofan in-order fetch, decode, retire core and an exemplary registerrenaming, out-of-order issue/execution architecture core to be includedin a processor according to embodiments of the invention;

FIG. 5A is a block diagram of a single processor core, along with itsconnection to an on-die interconnect network;

FIG. 5B illustrates an expanded view of part of the processor core inFIG. 5A according to embodiments of the invention;

FIG. 6 is a block diagram of a single core processor and a multicoreprocessor with integrated memory controller and graphics according toembodiments of the invention;

FIG. 7 illustrates a block diagram of a system in accordance with oneembodiment of the present invention;

FIG. 8 illustrates a block diagram of a second system in accordance withan embodiment of the present invention;

FIG. 9 illustrates a block diagram of a third system in accordance withan embodiment of the present invention;

FIG. 10 illustrates a block diagram of a system on a chip (SoC) inaccordance with an embodiment of the present invention;

FIG. 11 illustrates a block diagram contrasting the use of a softwareinstruction converter to convert binary instructions in a sourceinstruction set to binary instructions in a target instruction setaccording to embodiments of the invention;

FIG. 12 illustrates an exemplary processor on which embodiments of theinvention may be implemented;

FIG. 13 illustrates vector index load/store logic in accordance with oneembodiment of the invention;

FIG. 14 illustrates vector index load/store logic processing exemplarysets of indexes based on an exemplary immediate and mask values;

FIG. 15 illustrates a method for performing vector index load operationsin accordance with one embodiment of the invention; and

FIG. 16 illustrates a method for performing vector index storeoperations in accordance with one embodiment of the invention

DETAILED DESCRIPTION

In the following description, for the purposes of explanation, numerousspecific details are set forth in order to provide a thoroughunderstanding of the embodiments of the invention described below. Itwill be apparent, however, to one skilled in the art that theembodiments of the invention may be practiced without some of thesespecific details. In other instances, well-known structures and devicesare shown in block diagram form to avoid obscuring the underlyingprinciples of the embodiments of the invention.

Exemplary Processor Architecture and Data Types

An instruction set includes one or more instruction formats. A giveninstruction format defines various fields (number of bits, location ofbits) to specify, among other things, the operation to be performed(opcode) and the operand(s) on which that operation is to be performed.Some instruction formats are further broken down though the definitionof instruction templates (or subformats). For example, the instructiontemplates of a given instruction format may be defined to have differentsubsets of the instruction format's fields (the included fields aretypically in the same order, but at least some have different bitpositions because there are less fields included) and/or defined to havea given field interpreted differently. Thus, each instruction of an ISAis expressed using a given instruction format (and, if defined, in agiven one of the instruction templates of that instruction format) andincludes fields for specifying the operation and the operands. Forexample, an exemplary ADD instruction has a specific opcode and aninstruction format that includes an opcode field to specify that opcodeand operand fields to select operands (sourcel/destination and source2);and an occurrence of this ADD instruction in an instruction stream willhave specific contents in the operand fields that select specificoperands. A set of SIMD extensions referred to the Advanced VectorExtensions (AVX) (AVX1 and AVX2) and using the Vector Extensions (VEX)coding scheme, has been , has been released and/or published (e.g., seeIntel® 64 and IA-32 Architectures Software Developers Manual, October2011; and see Intel® Advanced Vector Extensions Programming Reference,June 2011).

Exemplary Instruction Formats

Embodiments of the instruction(s) described herein may be embodied indifferent formats. Additionally, exemplary systems, architectures, andpipelines are detailed below. Embodiments of the instruction(s) may beexecuted on such systems, architectures, and pipelines, but are notlimited to those detailed.

A. Generic Vector Friendly Instruction Format

A vector friendly instruction format is an instruction format that issuited for vector instructions (e.g., there are certain fields specificto vector operations). While embodiments are described in which bothvector and scalar operations are supported through the vector friendlyinstruction format, alternative embodiments use only vector operationsthe vector friendly instruction format.

FIGS. 1A-1B are block diagrams illustrating a generic vector friendlyinstruction format and instruction templates thereof according toembodiments of the invention. FIG. 1A is a block diagram illustrating ageneric vector friendly instruction format and class A instructiontemplates thereof according to embodiments of the invention; while FIG.1B is a block diagram illustrating the generic vector friendlyinstruction format and class B instruction templates thereof accordingto embodiments of the invention. Specifically, a generic vector friendlyinstruction format 100 for which are defined class A and class Binstruction templates, both of which include no memory access 105instruction templates and memory access 120 instruction templates. Theterm generic in the context of the vector friendly instruction formatrefers to the instruction format not being tied to any specificinstruction set.

While embodiments of the invention will be described in which the vectorfriendly instruction format supports the following: a 64 byte vectoroperand length (or size) with 32 bit (4 byte) or 64 bit (8 byte) dataelement widths (or sizes) (and thus, a 64 byte vector consists of either16 doubleword-size elements or alternatively, 8 quadword-size elements);a 64 byte vector operand length (or size) with 16 bit (2 byte) or 8 bit(1 byte) data element widths (or sizes); a 32 byte vector operand length(or size) with 32 bit (4 byte), 64 bit (8 byte), 16 bit (2 byte), or 8bit (1 byte) data element widths (or sizes); and a 16 byte vectoroperand length (or size) with 32 bit (4 byte), 64 bit (8 byte), 16 bit(2 byte), or 8 bit (1 byte) data element widths (or sizes); alternativeembodiments may support more, less and/or different vector operand sizes(e.g., 256 byte vector operands) with more, less, or different dataelement widths (e.g., 128 bit (16 byte) data element widths).

The class A instruction templates in FIG. 1A include: 1) within the nomemory access 105 instruction templates there is shown a no memoryaccess, full round control type operation 110 instruction template and ano memory access, data transform type operation 115 instructiontemplate; and 2) within the memory access 120 instruction templatesthere is shown a memory access, temporal 125 instruction template and amemory access, non-temporal 130 instruction template. The class Binstruction templates in FIG. 1B include: 1) within the no memory access105 instruction templates there is shown a no memory access, write maskcontrol, partial round control type operation 112 instruction templateand a no memory access, write mask control, vsize type operation 117instruction template; and 2) within the memory access 120 instructiontemplates there is shown a memory access, write mask control 127instruction template.

The generic vector friendly instruction format 100 includes thefollowing fields listed below in the order illustrated in FIGS. 1A-1B.

Format field 140—a specific value (an instruction format identifiervalue) in this field uniquely identifies the vector friendly instructionformat, and thus occurrences of instructions in the vector friendlyinstruction format in instruction streams. As such, this field isoptional in the sense that it is not needed for an instruction set thathas only the generic vector friendly instruction format.

Base operation field 142—its content distinguishes different baseoperations.

Register index field 144—its content, directly or through addressgeneration, specifies the locations of the source and destinationoperands, be they in registers or in memory. These include a sufficientnumber of bits to select N registers from a P×Q (e.g. 32×512, 16×128,32×1024, 64×1024) register file. While in one embodiment N may be up tothree sources and one destination register, alternative embodiments maysupport more or less sources and destination registers (e.g., maysupport up to two sources where one of these sources also acts as thedestination, may support up to three sources where one of these sourcesalso acts as the destination, may support up to two sources and onedestination).

Modifier field 146—its content distinguishes occurrences of instructionsin the generic vector instruction format that specify memory access fromthose that do not; that is, between no memory access 105 instructiontemplates and memory access 120 instruction templates. Memory accessoperations read and/or write to the memory hierarchy (in some casesspecifying the source and/or destination addresses using values inregisters), while non-memory access operations do not (e.g., the sourceand destinations are registers). While in one embodiment this field alsoselects between three different ways to perform memory addresscalculations, alternative embodiments may support more, less, ordifferent ways to perform memory address calculations.

Augmentation operation field 150—its content distinguishes which one ofa variety of different operations to be performed in addition to thebase operation. This field is context specific. In one embodiment of theinvention, this field is divided into a class field 168, an alpha field152, and a beta field 154. The augmentation operation field 150 allowscommon groups of operations to be performed in a single instructionrather than 2, 3, or 4 instructions.

Scale field 160—its content allows for the scaling of the index field'scontent for memory address generation (e.g., for address generation thatuses 2^(scale)*index+base).

Displacement Field 162A—its content is used as part of memory addressgeneration (e.g., for address generation that uses2^(scale)*index+base+displacement).

Displacement Factor Field 162B (note that the juxtaposition ofdisplacement field 162A directly over displacement factor field 162Bindicates one or the other is used)—its content is used as part ofaddress generation; it specifies a displacement factor that is to bescaled by the size of a memory access (N)—where N is the number of bytesin the memory access (e.g., for address generation that uses2^(scale)*index+base+scaled displacement). Redundant low-order bits areignored and hence, the displacement factor field's content is multipliedby the memory operands total size (N) in order to generate the finaldisplacement to be used in calculating an effective address. The valueof N is determined by the processor hardware at runtime based on thefull opcode field 174 (described later herein) and the data manipulationfield 154C. The displacement field 162A and the displacement factorfield 162B are optional in the sense that they are not used for the nomemory access 105 instruction templates and/or different embodiments mayimplement only one or none of the two.

Data element width field 164—its content distinguishes which one of anumber of data element widths is to be used (in some embodiments for allinstructions; in other embodiments for only some of the instructions).This field is optional in the sense that it is not needed if only onedata element width is supported and/or data element widths are supportedusing some aspect of the opcodes.

Write mask field 170—its content controls, on a per data elementposition basis, whether that data element position in the destinationvector operand reflects the result of the base operation andaugmentation operation. Class A instruction templates supportmerging-writemasking, while class B instruction templates support bothmerging- and zeroing-writemasking. When merging, vector masks allow anyset of elements in the destination to be protected from updates duringthe execution of any operation (specified by the base operation and theaugmentation operation); in other one embodiment, preserving the oldvalue of each element of the destination where the corresponding maskbit has a 0. In contrast, when zeroing vector masks allow any set ofelements in the destination to be zeroed during the execution of anyoperation (specified by the base operation and the augmentationoperation); in one embodiment, an element of the destination is set to 0when the corresponding mask bit has a 0 value. A subset of thisfunctionality is the ability to control the vector length of theoperation being performed (that is, the span of elements being modified,from the first to the last one); however, it is not necessary that theelements that are modified be consecutive. Thus, the write mask field170 allows for partial vector operations, including loads, stores,arithmetic, logical, etc. While embodiments of the invention aredescribed in which the write mask field's 170 content selects one of anumber of write mask registers that contains the write mask to be used(and thus the write mask field's 170 content indirectly identifies thatmasking to be performed), alternative embodiments instead or additionalallow the mask write field's 170 content to directly specify the maskingto be performed.

Immediate field 172—its content allows for the specification of animmediate. This field is optional in the sense that is it not present inan implementation of the generic vector friendly format that does notsupport immediate and it is not present in instructions that do not usean immediate.

Class field 168—its content distinguishes between different classes ofinstructions. With reference to FIGS. 1A-B, the contents of this fieldselect between class A and class B instructions. In FIGS. 1A-B, roundedcorner squares are used to indicate a specific value is present in afield (e.g., class A 168A and class B 168B for the class field 168respectively in FIGS. 1A-B).

Instruction Templates of Class A

In the case of the non-memory access 105 instruction templates of classA, the alpha field 152 is interpreted as an RS field 152A, whose contentdistinguishes which one of the different augmentation operation typesare to be performed (e.g., round 152A.1 and data transform 152A.2 arerespectively specified for the no memory access, round type operation110 and the no memory access, data transform type operation 115instruction templates), while the beta field 154 distinguishes which ofthe operations of the specified type is to be performed. In the nomemory access 105 instruction templates, the scale field 160, thedisplacement field 162A, and the displacement scale filed 162B are notpresent.

No-Memory Access Instruction Templates—Full Round Control Type Operation

In the no memory access full round control type operation 110instruction template, the beta field 154 is interpreted as a roundcontrol field 154A, whose content(s) provide static rounding. While inthe described embodiments of the invention the round control field 154Aincludes a suppress all floating point exceptions (SAE) field 156 and around operation control field 158, alternative embodiments may supportmay encode both these concepts into the same field or only have one orthe other of these concepts/fields (e.g., may have only the roundoperation control field 158).

SAE field 156—its content distinguishes whether or not to disable theexception event reporting; when the SAE field's 156 content indicatessuppression is enabled, a given instruction does not report any kind offloating-point exception flag and does not raise any floating pointexception handler.

Round operation control field 158—its content distinguishes which one ofa group of rounding operations to perform (e.g., Round-up, Round-down,Round-towards-zero and Round-to-nearest). Thus, the round operationcontrol field 158 allows for the changing of the rounding mode on a perinstruction basis. In one embodiment of the invention where a processorincludes a control register for specifying rounding modes, the roundoperation control field's 150 content overrides that register value.

No Memory Access Instruction Templates—Data Transform Type Operation

In the no memory access data transform type operation 115 instructiontemplate, the beta field 154 is interpreted as a data transform field154B, whose content distinguishes which one of a number of datatransforms is to be performed (e.g., no data transform, swizzle,broadcast).

In the case of a memory access 120 instruction template of class A, thealpha field 152 is interpreted as an eviction hint field 152B, whosecontent distinguishes which one of the eviction hints is to be used (inFIG. 1A, temporal 152B.1 and non-temporal 152B.2 are respectivelyspecified for the memory access, temporal 125 instruction template andthe memory access, non-temporal 130 instruction template), while thebeta field 154 is interpreted as a data manipulation field 154C, whosecontent distinguishes which one of a number of data manipulationoperations (also known as primitives) is to be performed (e.g., nomanipulation; broadcast; up conversion of a source; and down conversionof a destination). The memory access 120 instruction templates includethe scale field 160, and optionally the displacement field 162A or thedisplacement scale field 162B.

Vector memory instructions perform vector loads from and vector storesto memory, with conversion support. As with regular vector instructions,vector memory instructions transfer data from/to memory in a dataelement-wise fashion, with the elements that are actually transferred isdictated by the contents of the vector mask that is selected as thewrite mask.

Memory Access Instruction Templates—Temporal

Temporal data is data likely to be reused soon enough to benefit fromcaching. This is, however, a hint, and different processors mayimplement it in different ways, including ignoring the hint entirely.

Memory Access Instruction Templates—Non-Temporal

Non-temporal data is data unlikely to be reused soon enough to benefitfrom caching in the 1st-level cache and should be given priority foreviction. This is, however, a hint, and different processors mayimplement it in different ways, including ignoring the hint entirely.

Instruction Templates of Class B

In the case of the instruction templates of class B, the alpha field 152is interpreted as a write mask control (Z) field 152C, whose contentdistinguishes whether the write masking controlled by the write maskfield 170 should be a merging or a zeroing.

In the case of the non-memory access 105 instruction templates of classB, part of the beta field 154 is interpreted as an RL field 157A, whosecontent distinguishes which one of the different augmentation operationtypes are to be performed (e.g., round 157A.1 and vector length (VSIZE)157A.2 are respectively specified for the no memory access, write maskcontrol, partial round control type operation 112 instruction templateand the no memory access, write mask control, VSIZE type operation 117instruction template), while the rest of the beta field 154distinguishes which of the operations of the specified type is to beperformed. In the no memory access 105 instruction templates, the scalefield 160, the displacement field 162A, and the displacement scale filed162B are not present.

In the no memory access, write mask control, partial round control typeoperation 110 instruction template, the rest of the beta field 154 isinterpreted as a round operation field 159A and exception eventreporting is disabled (a given instruction does not report any kind offloating-point exception flag and does not raise any floating pointexception handler).

Round operation control field 159A—just as round operation control field158, its content distinguishes which one of a group of roundingoperations to perform (e.g., Round-up, Round-down, Round-towards-zeroand Round-to-nearest). Thus, the round operation control field 159Aallows for the changing of the rounding mode on a per instruction basis.In one embodiment of the invention where a processor includes a controlregister for specifying rounding modes, the round operation controlfield's 150 content overrides that register value.

In the no memory access, write mask control, VSIZE type operation 117instruction template, the rest of the beta field 154 is interpreted as avector length field 159B, whose content distinguishes which one of anumber of data vector lengths is to be performed on (e.g., 128, 256, or512 byte).

In the case of a memory access 120 instruction template of class B, partof the beta field 154 is interpreted as a broadcast field 157B, whosecontent distinguishes whether or not the broadcast type datamanipulation operation is to be performed, while the rest of the betafield 154 is interpreted the vector length field 159B. The memory access120 instruction templates include the scale field 160, and optionallythe displacement field 162A or the displacement scale field 162B.

With regard to the generic vector friendly instruction format 100, afull opcode field 174 is shown including the format field 140, the baseoperation field 142, and the data element width field 164. While oneembodiment is shown where the full opcode field 174 includes all ofthese fields, the full opcode field 174 includes less than all of thesefields in embodiments that do not support all of them. The full opcodefield 174 provides the operation code (opcode).

The augmentation operation field 150, the data element width field 164,and the write mask field 170 allow these features to be specified on aper instruction basis in the generic vector friendly instruction format.

The combination of write mask field and data element width field createtyped instructions in that they allow the mask to be applied based ondifferent data element widths.

The various instruction templates found within class A and class B arebeneficial in different situations. In some embodiments of theinvention, different processors or different cores within a processormay support only class A, only class B, or both classes. For instance, ahigh performance general purpose out-of-order core intended forgeneral-purpose computing may support only class B, a core intendedprimarily for graphics and/or scientific (throughput) computing maysupport only class A, and a core intended for both may support both (ofcourse, a core that has some mix of templates and instructions from bothclasses but not all templates and instructions from both classes iswithin the purview of the invention). Also, a single processor mayinclude multiple cores, all of which support the same class or in whichdifferent cores support different class. For instance, in a processorwith separate graphics and general purpose cores, one of the graphicscores intended primarily for graphics and/or scientific computing maysupport only class A, while one or more of the general purpose cores maybe high performance general purpose cores with out of order executionand register renaming intended for general-purpose computing thatsupport only class B. Another processor that does not have a separategraphics core, may include one more general purpose in-order orout-of-order cores that support both class A and class B. Of course,features from one class may also be implement in the other class indifferent embodiments of the invention. Programs written in a high levellanguage would be put (e.g., just in time compiled or staticallycompiled) into an variety of different executable forms, including: 1) aform having only instructions of the class(es) supported by the targetprocessor for execution; or 2) a form having alternative routineswritten using different combinations of the instructions of all classesand having control flow code that selects the routines to execute basedon the instructions supported by the processor which is currentlyexecuting the code.

B. Exemplary Specific Vector Friendly Instruction Format

FIG. 2 is a block diagram illustrating an exemplary specific vectorfriendly instruction format according to embodiments of the invention.FIG. 2 shows a specific vector friendly instruction format 200 that isspecific in the sense that it specifies the location, size,interpretation, and order of the fields, as well as values for some ofthose fields. The specific vector friendly instruction format 200 may beused to extend the x86 instruction set, and thus some of the fields aresimilar or the same as those used in the existing x86 instruction setand extension thereof (e.g., AVX). This format remains consistent withthe prefix encoding field, real opcode byte field, MOD R/M field, SIBfield, displacement field, and immediate fields of the existing x86instruction set with extensions. The fields from FIG. 1 into which thefields from FIG. 2 map are illustrated.

It should be understood that, although embodiments of the invention aredescribed with reference to the specific vector friendly instructionformat 200 in the context of the generic vector friendly instructionformat 100 for illustrative purposes, the invention is not limited tothe specific vector friendly instruction format 200 except whereclaimed. For example, the generic vector friendly instruction format 100contemplates a variety of possible sizes for the various fields, whilethe specific vector friendly instruction format 200 is shown as havingfields of specific sizes. By way of specific example, while the dataelement width field 164 is illustrated as a one bit field in thespecific vector friendly instruction format 200, the invention is not solimited (that is, the generic vector friendly instruction format 100contemplates other sizes of the data element width field 164).

The generic vector friendly instruction format 100 includes thefollowing fields listed below in the order illustrated in FIG. 2A.

EVEX Prefix (Bytes 0-3) 202—is encoded in a four-byte form.

Format Field 140 (EVEX Byte 0, bits [7:0])—the first byte (EVEX Byte 0)is the format field 140 and it contains 0x62 (the unique value used fordistinguishing the vector friendly instruction format in one embodimentof the invention).

The second-fourth bytes (EVEX Bytes 1-3) include a number of bit fieldsproviding specific capability.

REX field 205 (EVEX Byte 1, bits [7-5])—consists of a EVEX.R bit field(EVEX Byte 1, bit [7]—R), EVEX.X bit field (EVEX byte 1, bit [6]—X), and157BEX byte 1, bit[5]—B). The EVEX.R, EVEX.X, and EVEX.B bit fieldsprovide the same functionality as the corresponding VEX bit fields, andare encoded using 1s complement form, i.e. ZMM0 is encoded as 1111B,ZMM15 is encoded as 0000B. Other fields of the instructions encode thelower three bits of the register indexes as is known in the art (rrr,xxx, and bbb), so that Rrrr, Xxxx, and Bbbb may be formed by addingEVEX.R, EVEX.X, and EVEX.B.

REX′ field 110—this is the first part of the REX′ field 110 and is theEVEX.R′ bit field (EVEX Byte 1, bit [4]—R′) that is used to encodeeither the upper 16 or lower 16 of the extended 32 register set. In oneembodiment of the invention, this bit, along with others as indicatedbelow, is stored in bit inverted format to distinguish (in thewell-known x86 32-bit mode) from the BOUND instruction, whose realopcode byte is 62, but does not accept in the MOD R/M field (describedbelow) the value of 11 in the MOD field; alternative embodiments of theinvention do not store this and the other indicated bits below in theinverted format. A value of 1 is used to encode the lower 16 registers.In other words, R′Rrrr is formed by combining EVEX.R′, EVEX.R, and theother RRR from other fields.

Opcode map field 215 (EVEX byte 1, bits [3:0]—mmmm)—its content encodesan implied leading opcode byte (0F, 0F 38, or 0F 3).

Data element width field 164 (EVEX byte 2, bit [7]—W)—is represented bythe notation EVEX.W. EVEX.W is used to define the granularity (size) ofthe datatype (either 32-bit data elements or 64-bit data elements).

EVEX.vvvv 220 (EVEX Byte 2, bits [6:3]-vvvv)—the role of EVEX.vvvv mayinclude the following: 1) EVEX.vvvv encodes the first source registeroperand, specified in inverted (1s complement) form and is valid forinstructions with 2 or more source operands; 2) EVEX.vvvv encodes thedestination register operand, specified in 1s complement form forcertain vector shifts; or 3) EVEX.vvvv does not encode any operand, thefield is reserved and should contain 1111b. Thus, EVEX.vvvv field 220encodes the 4 low-order bits of the first source register specifierstored in inverted (1s complement) form. Depending on the instruction,an extra different EVEX bit field is used to extend the specifier sizeto 32 registers.

EVEX.U 168 Class field (EVEX byte 2, bit [2]-U)—If EVEX.U=0, itindicates class A or EVEX.U0; if EVEX.U=1, it indicates class B orEVEX.U1.

Prefix encoding field 225 (EVEX byte 2, bits [1:0]-pp)—providesadditional bits for the base operation field. In addition to providingsupport for the legacy SSE instructions in the EVEX prefix format, thisalso has the benefit of compacting the SIMD prefix (rather thanrequiring a byte to express the SIMD prefix, the EVEX prefix requiresonly 2 bits). In one embodiment, to support legacy SSE instructions thatuse a SIMD prefix (66H, F2H, F3H) in both the legacy format and in theEVEX prefix format, these legacy SIMD prefixes are encoded into the SIMDprefix encoding field; and at runtime are expanded into the legacy SIMDprefix prior to being provided to the decoder's PLA (so the PLA canexecute both the legacy and EVEX format of these legacy instructionswithout modification). Although newer instructions could use the EVEXprefix encoding field's content directly as an opcode extension, certainembodiments expand in a similar fashion for consistency but allow fordifferent meanings to be specified by these legacy SIMD prefixes. Analternative embodiment may redesign the PLA to support the 2 bit SIMDprefix encodings, and thus not require the expansion.

Alpha field 152 (EVEX byte 3, bit [7]—EH; also known as EVEX.EH,EVEX.rs, EVEX.RL, EVEX.write mask control, and EVEX.N; also illustratedwith α)—as previously described, this field is context specific.

Beta field 154 (EVEX byte 3, bits [6:4]-SSS, also known as EVEX.s₂₋₀,EVEX.r₂₋₀, EVEX.rr1, EVEX.LL0, EVEX.LLB; also illustrated with βββ)—aspreviously described, this field is context specific.

REX′ field 110—this is the remainder of the REX′ field and is theEVEX.V′ bit field (EVEX Byte 3, bit [3]—V′) that may be used to encodeeither the upper 16 or lower 16 of the extended 32 register set. Thisbit is stored in bit inverted format. A value of 1 is used to encode thelower 16 registers. In other words, V′VVVV is formed by combiningEVEX.V′, EVEX.vvvv.

Write mask field 170 (EVEX byte 3, bits [2:0]-kkk)—its content specifiesthe index of a register in the write mask registers as previouslydescribed. In one embodiment of the invention, the specific valueEVEX.kkk=000 has a special behavior implying no write mask is used forthe particular instruction (this may be implemented in a variety of waysincluding the use of a write mask hardwired to all ones or hardware thatbypasses the masking hardware).

Real Opcode Field 230 (Byte 4) is also known as the opcode byte. Part ofthe opcode is specified in this field.

MOD R/M Field 240 (Byte 5) includes MOD field 242, Reg field 244, andR/M field 246. As previously described, the MOD field's 242 contentdistinguishes between memory access and non-memory access operations.The role of Reg field 244 can be summarized to two situations: encodingeither the destination register operand or a source register operand, orbe treated as an opcode extension and not used to encode any instructionoperand. The role of R/M field 246 may include the following: encodingthe instruction operand that references a memory address, or encodingeither the destination register operand or a source register operand.

Scale, Index, Base (SIB) Byte (Byte 6)—As previously described, thescale field's 150 content is used for memory address generation. SIB.xxx254 and SIB.bbb 256—the contents of these fields have been previouslyreferred to with regard to the register indexes Xxxx and Bbbb.

Displacement field 162A (Bytes 7-10)—when MOD field 242 contains 10,bytes 7-10 are the displacement field 162A, and it works the same as thelegacy 32-bit displacement (disp32) and works at byte granularity.

Displacement factor field 162B (Byte 7)—when MOD field 242 contains 01,byte 7 is the displacement factor field 162B. The location of this fieldis that same as that of the legacy x86 instruction set 8-bitdisplacement (disp8), which works at byte granularity. Since disp8 issign extended, it can only address between −128 and 127 bytes offsets;in terms of 64 byte cache lines, disp8 uses 8 bits that can be set toonly four really useful values -128, -64, 0, and 64; since a greaterrange is often needed, disp32 is used; however, disp32 requires 4 bytes.In contrast to disp8 and disp32, the displacement factor field 162B is areinterpretation of disp8; when using displacement factor field 162B,the actual displacement is determined by the content of the displacementfactor field multiplied by the size of the memory operand access (N).This type of displacement is referred to as disp8*N. This reduces theaverage instruction length (a single byte of used for the displacementbut with a much greater range). Such compressed displacement is based onthe assumption that the effective displacement is multiple of thegranularity of the memory access, and hence, the redundant low-orderbits of the address offset do not need to be encoded. In other words,the displacement factor field 162B substitutes the legacy x86instruction set 8-bit displacement. Thus, the displacement factor field162B is encoded the same way as an x86 instruction set 8-bitdisplacement (so no changes in the ModRM/SIB encoding rules) with theonly exception that disp8 is overloaded to disp8*N. In other words,there are no changes in the encoding rules or encoding lengths but onlyin the interpretation of the displacement value by hardware (which needsto scale the displacement by the size of the memory operand to obtain abyte-wise address offset).

Immediate field 172 operates as previously described.

Full Opcode Field

FIG. 2B is a block diagram illustrating the fields of the specificvector friendly instruction format 200 that make up the full opcodefield 174 according to one embodiment of the invention. Specifically,the full opcode field 174 includes the format field 140, the baseoperation field 142, and the data element width (W) field 164. The baseoperation field 142 includes the prefix encoding field 225, the opcodemap field 215, and the real opcode field 230.

Register Index Field

FIG. 2C is a block diagram illustrating the fields of the specificvector friendly instruction format 200 that make up the register indexfield 144 according to one embodiment of the invention. Specifically,the register index field 144 includes the REX field 205, the REX′ field210, the MODR/M.reg field 244, the MODR/M.r/m field 246, the WW field220, xxx field 254, and the bbb field 256.

Augmentation Operation Field

FIG. 2D is a block diagram illustrating the fields of the specificvector friendly instruction format 200 that make up the augmentationoperation field 150 according to one embodiment of the invention. Whenthe class (U) field 168 contains 0, it signifies EVEX.U0 (class A 168A);when it contains 1, it signifies EVEX.U1 (class B 168B). When U=0 andthe MOD field 242 contains 11 (signifying a no memory access operation),the alpha field 152 (EVEX byte 3, bit [7]—EH) is interpreted as the rsfield 152A. When the rs field 152A contains a 1 (round 152A.1), the betafield 154 (EVEX byte 3, bits [6:4]—SSS) is interpreted as the roundcontrol field 154A. The round control field 154A includes a one bit SAEfield 156 and a two bit round operation field 158. When the rs field152A contains a 0 (data transform 152A.2), the beta field 154 (EVEX byte3, bits [6:4]-SSS) is interpreted as a three bit data transform field154B. When U=0 and the MOD field 242 contains 00, 01, or 10 (signifyinga memory access operation), the alpha field 152 (EVEX byte 3, bit[7]—EH) is interpreted as the eviction hint (EH) field 152B and the betafield 154 (EVEX byte 3, bits [6:4]—SSS) is interpreted as a three bitdata manipulation field 154C.

When U=1, the alpha field 152 (EVEX byte 3, bit [7]—EH) is interpretedas the write mask control (Z) field 152C. When U=1 and the MOD field 242contains 11 (signifying a no memory access operation), part of the betafield 154 (EVEX byte 3, bit [4]—S₀) is interpreted as the RL field 157A;when it contains a 1 (round 157A.1) the rest of the beta field 154 (EVEXbyte 3, bit [6-5]—S₂₋₁) is interpreted as the round operation field159A, while when the RL field 157A contains a 0 (VSIZE 157.A2) the restof the beta field 154 (EVEX byte 3, bit [6-5]—S₂₋₁) is interpreted asthe vector length field 159B (EVEX byte 3, bit [6-5]—L₁₋₀). When U=1 andthe MOD field 242 contains 00, 01, or 10 (signifying a memory accessoperation), the beta field 154 (EVEX byte 3, bits [6:4]—SSS) isinterpreted as the vector length field 159B (EVEX byte 3, bit[6-5]—L₁₋₀) and the broadcast field 157B (EVEX byte 3, bit [4]—B).

C. Exemplary Register Architecture

FIG. 3 is a block diagram of a register architecture 300 according toone embodiment of the invention. In the embodiment illustrated, thereare 32 vector registers 310 that are 512 bits wide; these registers arereferenced as zmm0 through zmm31. The lower order 256 bits of the lower16 zmm registers are overlaid on registers ymm0-16. The lower order 128bits of the lower 16 zmm registers (the lower order 128 bits of the ymmregisters) are overlaid on registers xmm0-15. The specific vectorfriendly instruction format 200 operates on these overlaid register fileas illustrated in the below tables.

Adjustable Vector Opera- Length Class tions Registers Instruction A(FIG. 110, 115, zmm registers (the vector Templates that 1A; U = 0) 125,130 length is 64 byte) do not include B (FIG. 112 zmm registers (thevector the vector length 1B; U = 1) length is 64 byte) field 159BInstruction B (FIG. 117, 127 zmm, ymm, or xmm templates that 1B; U = 1)registers (the vector length do include the is 64 byte, 32 byte, orvector length 16 byte) depending on the field 159B vector length field159B

In other words, the vector length field 159B selects between a maximumlength and one or more other shorter lengths, where each such shorterlength is half the length of the preceding length; and instructionstemplates without the vector length field 159B operate on the maximumvector length. Further, in one embodiment, the class B instructiontemplates of the specific vector friendly instruction format 200 operateon packed or scalar single/double-precision floating point data andpacked or scalar integer data. Scalar operations are operationsperformed on the lowest order data element position in an zmm/ymm/xmmregister; the higher order data element positions are either left thesame as they were prior to the instruction or zeroed depending on theembodiment.

Write mask registers 315—in the embodiment illustrated, there are 8write mask registers (k0 through k7), each 64 bits in size. In analternate embodiment, the write mask registers 315 are 16 bits in size.As previously described, in one embodiment of the invention, the vectormask register k0 cannot be used as a write mask; when the encoding thatwould normally indicate k0 is used for a write mask, it selects ahardwired write mask of 0xFFFF, effectively disabling write masking forthat instruction.

General-purpose registers 325—in the embodiment illustrated, there aresixteen 64-bit general-purpose registers that are used along with theexisting x86 addressing modes to address memory operands. Theseregisters are referenced by the names RAX, RBX, RCX, RDX, RBP, RSI, RDI,RSP, and R8 through R15.

Scalar floating point stack register file (x87 stack) 345, on which isaliased the MMX packed integer flat register file 350—in the embodimentillustrated, the x87 stack is an eight-element stack used to performscalar floating-point operations on 32/64/80-bit floating point datausing the x87 instruction set extension; while the MMX registers areused to perform operations on 64-bit packed integer data, as well as tohold operands for some operations performed between the MMX and XMMregisters.

Alternative embodiments of the invention may use wider or narrowerregisters. Additionally, alternative embodiments of the invention mayuse more, less, or different register files and registers.

D. Exemplary Core Architectures, Processors, and Computer Architectures

Processor cores may be implemented in different ways, for differentpurposes, and in different processors. For instance, implementations ofsuch cores may include: 1) a general purpose in-order core intended forgeneral-purpose computing; 2) a high performance general purposeout-of-order core intended for general-purpose computing; 3) a specialpurpose core intended primarily for graphics and/or scientific(throughput) computing. Implementations of different processors mayinclude: 1) a CPU including one or more general purpose in-order coresintended for general-purpose computing and/or one or more generalpurpose out-of-order cores intended for general-purpose computing; and2) a coprocessor including one or more special purpose cores intendedprimarily for graphics and/or scientific (throughput). Such differentprocessors lead to different computer system architectures, which mayinclude: 1) the coprocessor on a separate chip from the CPU; 2) thecoprocessor on a separate die in the same package as a CPU; 3) thecoprocessor on the same die as a CPU (in which case, such a coprocessoris sometimes referred to as special purpose logic, such as integratedgraphics and/or scientific (throughput) logic, or as special purposecores); and 4) a system on a chip that may include on the same die thedescribed CPU (sometimes referred to as the application core(s) orapplication processor(s)), the above described coprocessor, andadditional functionality. Exemplary core architectures are describednext, followed by descriptions of exemplary processors and computerarchitectures.

FIG. 4A is a block diagram illustrating both an exemplary in-orderpipeline and an exemplary register renaming, out-of-orderissue/execution pipeline according to embodiments of the invention. FIG.4B is a block diagram illustrating both an exemplary embodiment of anin-order architecture core and an exemplary register renaming,out-of-order issue/execution architecture core to be included in aprocessor according to embodiments of the invention. The solid linedboxes in FIGS. 4A-B illustrate the in-order pipeline and in-order core,while the optional addition of the dashed lined boxes illustrates theregister renaming, out-of-order issue/execution pipeline and core. Giventhat the in-order aspect is a subset of the out-of-order aspect, theout-of-order aspect will be described.

In FIG. 4A, a processor pipeline 400 includes a fetch stage 402, alength decode stage 404, a decode stage 406, an allocation stage 408, arenaming stage 410, a scheduling (also known as a dispatch or issue)stage 412, a register read/memory read stage 414, an execute stage 416,a write back/memory write stage 418, an exception handling stage 422,and a commit stage 424.

FIG. 4B shows processor core 490 including a front end unit 430 coupledto an execution engine unit 450, and both are coupled to a memory unit470. The core 490 may be a reduced instruction set computing (RISC)core, a complex instruction set computing (CISC) core, a very longinstruction word (VLIW) core, or a hybrid or alternative core type. Asyet another option, the core 490 may be a special-purpose core, such as,for example, a network or communication core, compression engine,coprocessor core, general purpose computing graphics processing unit(GPGPU) core, graphics core, or the like.

The front end unit 430 includes a branch prediction unit 432 coupled toan instruction cache unit 434, which is coupled to an instructiontranslation lookaside buffer (TLB) 436, which is coupled to aninstruction fetch unit 438, which is coupled to a decode unit 440. Thedecode unit 440 (or decoder) may decode instructions, and generate as anoutput one or more micro-operations, micro-code entry points,microinstructions, other instructions, or other control signals, whichare decoded from, or which otherwise reflect, or are derived from, theoriginal instructions. The decode unit 440 may be implemented usingvarious different mechanisms. Examples of suitable mechanisms include,but are not limited to, look-up tables, hardware implementations,programmable logic arrays (PLAs), microcode read only memories (ROMs),etc. In one embodiment, the core 490 includes a microcode ROM or othermedium that stores microcode for certain macroinstructions (e.g., indecode unit 440 or otherwise within the front end unit 430). The decodeunit 440 is coupled to a rename/allocator unit 452 in the executionengine unit 450.

The execution engine unit 450 includes the rename/allocator unit 452coupled to a retirement unit 454 and a set of one or more schedulerunit(s) 456. The scheduler unit(s) 456 represents any number ofdifferent schedulers, including reservations stations, centralinstruction window, etc. The scheduler unit(s) 456 is coupled to thephysical register file(s) unit(s) 458. Each of the physical registerfile(s) units 458 represents one or more physical register files,different ones of which store one or more different data types, such asscalar integer, scalar floating point, packed integer, packed floatingpoint, vector integer, vector floating point, status (e.g., aninstruction pointer that is the address of the next instruction to beexecuted), etc. In one embodiment, the physical register file(s) unit458 comprises a vector registers unit, a write mask registers unit, anda scalar registers unit. These register units may provide architecturalvector registers, vector mask registers, and general purpose registers.The physical register file(s) unit(s) 458 is overlapped by theretirement unit 454 to illustrate various ways in which registerrenaming and out-of-order execution may be implemented (e.g., using areorder buffer(s) and a retirement register file(s); using a futurefile(s), a history buffer(s), and a retirement register file(s); using aregister maps and a pool of registers; etc.). The retirement unit 454and the physical register file(s) unit(s) 458 are coupled to theexecution cluster(s) 460. The execution cluster(s) 460 includes a set ofone or more execution units 462 and a set of one or more memory accessunits 464. The execution units 462 may perform various operations (e.g.,shifts, addition, subtraction, multiplication) and on various types ofdata (e.g., scalar floating point, packed integer, packed floatingpoint, vector integer, vector floating point). While some embodimentsmay include a number of execution units dedicated to specific functionsor sets of functions, other embodiments may include only one executionunit or multiple execution units that all perform all functions. Thescheduler unit(s) 456, physical register file(s) unit(s) 458, andexecution cluster(s) 460 are shown as being possibly plural becausecertain embodiments create separate pipelines for certain types ofdata/operations (e.g., a scalar integer pipeline, a scalar floatingpoint/packed integer/packed floating point/vector integer/vectorfloating point pipeline, and/or a memory access pipeline that each havetheir own scheduler unit, physical register file(s) unit, and/orexecution cluster—and in the case of a separate memory access pipeline,certain embodiments are implemented in which only the execution clusterof this pipeline has the memory access unit(s) 464). It should also beunderstood that where separate pipelines are used, one or more of thesepipelines may be out-of-order issue/execution and the rest in-order.

The set of memory access units 464 is coupled to the memory unit 470,which includes a data TLB unit 472 coupled to a data cache unit 474coupled to a level 2 (L2) cache unit 476. In one exemplary embodiment,the memory access units 464 may include a load unit, a store addressunit, and a store data unit, each of which is coupled to the data TLBunit 472 in the memory unit 470. The instruction cache unit 434 isfurther coupled to a level 2 (L2) cache unit 476 in the memory unit 470.The L2 cache unit 476 is coupled to one or more other levels of cacheand eventually to a main memory.

By way of example, the exemplary register renaming, out-of-orderissue/execution core architecture may implement the pipeline 400 asfollows: 1) the instruction fetch 438 performs the fetch and lengthdecoding stages 402 and 404; 2) the decode unit 440 performs the decodestage 406; 3) the rename/allocator unit 452 performs the allocationstage 408 and renaming stage 410; 4) the scheduler unit(s) 456 performsthe schedule stage 412; 5) the physical register file(s) unit(s) 458 andthe memory unit 470 perform the register read/memory read stage 414; theexecution cluster 460 perform the execute stage 416; 6) the memory unit470 and the physical register file(s) unit(s) 458 perform the writeback/memory write stage 418; 7) various units may be involved in theexception handling stage 422; and 8) the retirement unit 454 and thephysical register file(s) unit(s) 458 perform the commit stage 424.

The core 490 may support one or more instructions sets (e.g., the x86instruction set (with some extensions that have been added with newerversions); the MIPS instruction set of MIPS Technologies of Sunnyvale,Calif.; the ARM instruction set (with optional additional extensionssuch as NEON) of ARM Holdings of Sunnyvale, Calif.), including theinstruction(s) described herein. In one embodiment, the core 490includes logic to support a packed data instruction set extension (e.g.,AVX1, AVX2), thereby allowing the operations used by many multimediaapplications to be performed using packed data.

It should be understood that the core may support multithreading(executing two or more parallel sets of operations or threads), and maydo so in a variety of ways including time sliced multithreading,simultaneous multithreading (where a single physical core provides alogical core for each of the threads that physical core issimultaneously multithreading), or a combination thereof (e.g., timesliced fetching and decoding and simultaneous multithreading thereaftersuch as in the Intel® Hyperthreading technology).

While register renaming is described in the context of out-of-orderexecution, it should be understood that register renaming may be used inan in-order architecture. While the illustrated embodiment of theprocessor also includes separate instruction and data cache units434/474 and a shared L2 cache unit 476, alternative embodiments may havea single internal cache for both instructions and data, such as, forexample, a Level 1 (L1) internal cache, or multiple levels of internalcache. In some embodiments, the system may include a combination of aninternal cache and an external cache that is external to the core and/orthe processor. Alternatively, all of the cache may be external to thecore and/or the processor.

FIGS. 5A-B illustrate a block diagram of a more specific exemplaryin-order core architecture, which core would be one of several logicblocks (including other cores of the same type and/or different types)in a chip. The logic blocks communicate through a high-bandwidthinterconnect network (e.g., a ring network) with some fixed functionlogic, memory I/O interfaces, and other necessary I/O logic, dependingon the application.

FIG. 5A is a block diagram of a single processor core, along with itsconnection to the on-die interconnect network 502 and with its localsubset of the Level 2 (L2) cache 504, according to embodiments of theinvention. In one embodiment, an instruction decoder 500 supports thex86 instruction set with a packed data instruction set extension. An L1cache 506 allows low-latency accesses to cache memory into the scalarand vector units. While in one embodiment (to simplify the design), ascalar unit 508 and a vector unit 510 use separate register sets(respectively, scalar registers 512 and vector registers 514) and datatransferred between them is written to memory and then read back in froma level 1 (L1) cache 506, alternative embodiments of the invention mayuse a different approach (e.g., use a single register set or include acommunication path that allow data to be transferred between the tworegister files without being written and read back).

The local subset of the L2 cache 504 is part of a global L2 cache thatis divided into separate local subsets, one per processor core. Eachprocessor core has a direct access path to its own local subset of theL2 cache 504. Data read by a processor core is stored in its L2 cachesubset 504 and can be accessed quickly, in parallel with other processorcores accessing their own local L2 cache subsets. Data written by aprocessor core is stored in its own L2 cache subset 504 and is flushedfrom other subsets, if necessary. The ring network ensures coherency forshared data. The ring network is bi-directional to allow agents such asprocessor cores, L2 caches and other logic blocks to communicate witheach other within the chip. Each ring data-path is 1012-bits wide perdirection.

FIG. 5B is an expanded view of part of the processor core in FIG. 5Aaccording to embodiments of the invention. FIG. 5B includes an L1 datacache 506A part of the L1 cache 504, as well as more detail regardingthe vector unit 510 and the vector registers 514. Specifically, thevector unit 510 is a 16-wide vector processing unit (VPU) (see the16-wide ALU 528), which executes one or more of integer,single-precision float, and double-precision float instructions. The VPUsupports swizzling the register inputs with swizzle unit 520, numericconversion with numeric convert units 522A-B, and replication withreplication unit 524 on the memory input. Write mask registers 526 allowpredicating resulting vector writes.

FIG. 6 is a block diagram of a processor 600 that may have more than onecore, may have an integrated memory controller, and may have integratedgraphics according to embodiments of the invention. The solid linedboxes in FIG. 6 illustrate a processor 600 with a single core 602A, asystem agent 610, a set of one or more bus controller units 616, whilethe optional addition of the dashed lined boxes illustrates analternative processor 600 with multiple cores 602A-N, a set of one ormore integrated memory controller unit(s) 614 in the system agent unit610, and special purpose logic 608.

Thus, different implementations of the processor 600 may include: 1) aCPU with the special purpose logic 608 being integrated graphics and/orscientific (throughput) logic (which may include one or more cores), andthe cores 602A-N being one or more general purpose cores (e.g., generalpurpose in-order cores, general purpose out-of-order cores, acombination of the two); 2) a coprocessor with the cores 602A-N being alarge number of special purpose cores intended primarily for graphicsand/or scientific (throughput); and 3) a coprocessor with the cores602A-N being a large number of general purpose in-order cores. Thus, theprocessor 600 may be a general-purpose processor, coprocessor orspecial-purpose processor, such as, for example, a network orcommunication processor, compression engine, graphics processor, GPGPU(general purpose graphics processing unit), a high-throughput manyintegrated core (MIC) coprocessor (including 30 or more cores), embeddedprocessor, or the like. The processor may be implemented on one or morechips. The processor 600 may be a part of and/or may be implemented onone or more substrates using any of a number of process technologies,such as, for example, BiCMOS, CMOS, or NMOS.

The memory hierarchy includes one or more levels of cache within thecores, a set or one or more shared cache units 606, and external memory(not shown) coupled to the set of integrated memory controller units614. The set of shared cache units 606 may include one or more mid-levelcaches, such as level 2 (L2), level 3 (L3), level 4 (L4), or otherlevels of cache, a last level cache (LLC), and/or combinations thereof.While in one embodiment a ring based interconnect unit 612 interconnectsthe integrated graphics logic 608, the set of shared cache units 606,and the system agent unit 610/integrated memory controller unit(s) 614,alternative embodiments may use any number of well-known techniques forinterconnecting such units. In one embodiment, coherency is maintainedbetween one or more cache units 606 and cores 602-A-N.

In some embodiments, one or more of the cores 602A-N are capable ofmulti-threading. The system agent 610 includes those componentscoordinating and operating cores 602A-N. The system agent unit 610 mayinclude for example a power control unit (PCU) and a display unit. ThePCU may be or include logic and components needed for regulating thepower state of the cores 602A-N and the integrated graphics logic 608.The display unit is for driving one or more externally connecteddisplays.

The cores 602A-N may be homogenous or heterogeneous in terms ofarchitecture instruction set; that is, two or more of the cores 602A-Nmay be capable of execution the same instruction set, while others maybe capable of executing only a subset of that instruction set or adifferent instruction set.

FIGS. 7-10 are block diagrams of exemplary computer architectures. Othersystem designs and configurations known in the arts for laptops,desktops, handheld PCs, personal digital assistants, engineeringworkstations, servers, network devices, network hubs, switches, embeddedprocessors, digital signal processors (DSPs), graphics devices, videogame devices, set-top boxes, micro controllers, cell phones, portablemedia players, hand held devices, and various other electronic devices,are also suitable. In general, a huge variety of systems or electronicdevices capable of incorporating a processor and/or other executionlogic as disclosed herein are generally suitable.

Referring now to FIG. 7, shown is a block diagram of a system 700 inaccordance with one embodiment of the present invention. The system 700may include one or more processors 710, 715, which are coupled to acontroller hub 720. In one embodiment the controller hub 720 includes agraphics memory controller hub (GMCH) 790 and an Input/Output Hub (IOH)750 (which may be on separate chips); the GMCH 790 includes memory andgraphics controllers to which are coupled memory 740 and a coprocessor745; the IOH 750 is couples input/output (I/O) devices 760 to the GMCH790. Alternatively, one or both of the memory and graphics controllersare integrated within the processor (as described herein), the memory740 and the coprocessor 745 are coupled directly to the processor 710,and the controller hub 720 in a single chip with the IOH 750.

The optional nature of additional processors 715 is denoted in FIG. 7with broken lines. Each processor 710, 715 may include one or more ofthe processing cores described herein and may be some version of theprocessor 600.

The memory 740 may be, for example, dynamic random access memory (DRAM),phase change memory (PCM), or a combination of the two. For at least oneembodiment, the controller hub 720 communicates with the processor(s)710, 715 via a multi-drop bus, such as a frontside bus (FSB),point-to-point interface such as QuickPath Interconnect (QPI), orsimilar connection 795.

In one embodiment, the coprocessor 745 is a special-purpose processor,such as, for example, a high-throughput MIC processor, a network orcommunication processor, compression engine, graphics processor, GPGPU,embedded processor, or the like. In one embodiment, controller hub 720may include an integrated graphics accelerator.

There can be a variety of differences between the physical resources710, 715 in terms of a spectrum of metrics of merit includingarchitectural, microarchitectural, thermal, power consumptioncharacteristics, and the like.

In one embodiment, the processor 710 executes instructions that controldata processing operations of a general type. Embedded within theinstructions may be coprocessor instructions. The processor 710recognizes these coprocessor instructions as being of a type that shouldbe executed by the attached coprocessor 745. Accordingly, the processor710 issues these coprocessor instructions (or control signalsrepresenting coprocessor instructions) on a coprocessor bus or otherinterconnect, to coprocessor 745. Coprocessor(s) 745 accept and executethe received coprocessor instructions.

Referring now to FIG. 8, shown is a block diagram of a first morespecific exemplary system 800 in accordance with an embodiment of thepresent invention. As shown in FIG. 8, multiprocessor system 800 is apoint-to-point interconnect system, and includes a first processor 870and a second processor 880 coupled via a point-to-point interconnect850. Each of processors 870 and 880 may be some version of the processor600. In one embodiment of the invention, processors 870 and 880 arerespectively processors 710 and 715, while coprocessor 838 iscoprocessor 745. In another embodiment, processors 870 and 880 arerespectively processor 710 coprocessor 745.

Processors 870 and 880 are shown including integrated memory controller(IMC) units 872 and 882, respectively. Processor 870 also includes aspart of its bus controller units point-to-point (P-P) interfaces 876 and878; similarly, second processor 880 includes P-P interfaces 886 and888. Processors 870, 880 may exchange information via a point-to-point(P-P) interface 850 using P-P interface circuits 878, 888. As shown inFIG. 8, IMCs 872 and 882 couple the processors to respective memories,namely a memory 832 and a memory 834, which may be portions of mainmemory locally attached to the respective processors.

Processors 870, 880 may each exchange information with a chipset 890 viaindividual P-P interfaces 852, 854 using point to point interfacecircuits 876, 894, 886, 898. Chipset 890 may optionally exchangeinformation with the coprocessor 838 via a high-performance interface839. In one embodiment, the coprocessor 838 is a special-purposeprocessor, such as, for example, a high-throughput MIC processor, anetwork or communication processor, compression engine, graphicsprocessor, GPGPU, embedded processor, or the like.

A shared cache (not shown) may be included in either processor oroutside of both processors, yet connected with the processors via P-Pinterconnect, such that either or both processors' local cacheinformation may be stored in the shared cache if a processor is placedinto a low power mode.

Chipset 890 may be coupled to a first bus 816 via an interface 896. Inone embodiment, first bus 816 may be a Peripheral Component Interconnect(PCI) bus, or a bus such as a PCI Express bus or another thirdgeneration I/O interconnect bus, although the scope of the presentinvention is not so limited.

As shown in FIG. 8, various I/O devices 814 may be coupled to first bus816, along with a bus bridge 818 which couples first bus 816 to a secondbus 820. In one embodiment, one or more additional processor(s) 815,such as coprocessors, high-throughput MIC processors, GPGPU's,accelerators (such as, e.g., graphics accelerators or digital signalprocessing (DSP) units), field programmable gate arrays, or any otherprocessor, are coupled to first bus 816. In one embodiment, second bus820 may be a low pin count (LPC) bus. Various devices may be coupled toa second bus 820 including, for example, a keyboard and/or mouse 822,communication devices 827 and a storage unit 828 such as a disk drive orother mass storage device which may include instructions/code and data830, in one embodiment. Further, an audio I/O 824 may be coupled to thesecond bus 820. Note that other architectures are possible. For example,instead of the point-to-point architecture of FIG. 8, a system mayimplement a multi-drop bus or other such architecture.

Referring now to FIG. 9, shown is a block diagram of a second morespecific exemplary system 900 in accordance with an embodiment of thepresent invention. Like elements in FIGS. 8 and 9 bear like referencenumerals, and certain aspects of FIG. 8 have been omitted from FIG. 9 inorder to avoid obscuring other aspects of FIG. 9.

FIG. 9 illustrates that the processors 870, 880 may include integratedmemory and I/O control logic (“CL”) 872 and 882, respectively. Thus, theCL 872, 882 include integrated memory controller units and include I/Ocontrol logic. FIG. 9 illustrates that not only are the memories 832,834 coupled to the CL 872, 882, but also that I/O devices 914 are alsocoupled to the control logic 872, 882. Legacy I/O devices 915 arecoupled to the chipset 890.

Referring now to FIG. 10, shown is a block diagram of a SoC 1000 inaccordance with an embodiment of the present invention. Similar elementsin FIG. 6 bear like reference numerals. Also, dashed lined boxes areoptional features on more advanced SoCs. In FIG. 10, an interconnectunit(s) 1002 is coupled to: an application processor 1010 which includesa set of one or more cores 202A-N and shared cache unit(s) 606; a systemagent unit 610; a bus controller unit(s) 616; an integrated memorycontroller unit(s) 614; a set or one or more coprocessors 1020 which mayinclude integrated graphics logic, an image processor, an audioprocessor, and a video processor; an static random access memory (SRAM)unit 1030; a direct memory access (DMA) unit 1032; and a display unit1040 for coupling to one or more external displays. In one embodiment,the coprocessor(s) 1020 include a special-purpose processor, such as,for example, a network or communication processor, compression engine,GPGPU, a high-throughput MIC processor, embedded processor, or the like.

Embodiments of the mechanisms disclosed herein may be implemented inhardware, software, firmware, or a combination of such implementationapproaches. Embodiments of the invention may be implemented as computerprograms or program code executing on programmable systems comprising atleast one processor, a storage system (including volatile andnon-volatile memory and/or storage elements), at least one input device,and at least one output device.

Program code, such as code 830 illustrated in FIG. 8, may be applied toinput instructions to perform the functions described herein andgenerate output information. The output information may be applied toone or more output devices, in known fashion. For purposes of thisapplication, a processing system includes any system that has aprocessor, such as, for example; a digital signal processor (DSP), amicrocontroller, an application specific integrated circuit (ASIC), or amicroprocessor.

The program code may be implemented in a high level procedural or objectoriented programming language to communicate with a processing system.The program code may also be implemented in assembly or machinelanguage, if desired. In fact, the mechanisms described herein are notlimited in scope to any particular programming language. In any case,the language may be a compiled or interpreted language.

One or more aspects of at least one embodiment may be implemented byrepresentative instructions stored on a machine-readable medium whichrepresents various logic within the processor, which when read by amachine causes the machine to fabricate logic to perform the techniquesdescribed herein. Such representations, known as “IP cores” may bestored on a tangible, machine readable medium and supplied to variouscustomers or manufacturing facilities to load into the fabricationmachines that actually make the logic or processor.

Such machine-readable storage media may include, without limitation,non-transitory, tangible arrangements of articles manufactured or formedby a machine or device, including storage media such as hard disks, anyother type of disk including floppy disks, optical disks, compact diskread-only memories (CD-ROMs), compact disk rewritable's (CD-RWs), andmagneto-optical disks, semiconductor devices such as read-only memories(ROMs), random access memories (RAMs) such as dynamic random accessmemories (DRAMs), static random access memories (SRAMs), erasableprogrammable read-only memories (EPROMs), flash memories, electricallyerasable programmable read-only memories (EEPROMs), phase change memory(PCM), magnetic or optical cards, or any other type of media suitablefor storing electronic instructions.

Accordingly, embodiments of the invention also include non-transitory,tangible machine-readable media containing instructions or containingdesign data, such as Hardware Description Language (HDL), which definesstructures, circuits, apparatuses, processors and/or system featuresdescribed herein. Such embodiments may also be referred to as programproducts.

In some cases, an instruction converter may be used to convert aninstruction from a source instruction set to a target instruction set.For example, the instruction converter may translate (e.g., using staticbinary translation, dynamic binary translation including dynamiccompilation), morph, emulate, or otherwise convert an instruction to oneor more other instructions to be processed by the core. The instructionconverter may be implemented in software, hardware, firmware, or acombination thereof. The instruction converter may be on processor, offprocessor, or part on and part off processor.

FIG. 11 is a block diagram contrasting the use of a software instructionconverter to convert binary instructions in a source instruction set tobinary instructions in a target instruction set according to embodimentsof the invention. In the illustrated embodiment, the instructionconverter is a software instruction converter, although alternativelythe instruction converter may be implemented in software, firmware,hardware, or various combinations thereof. FIG. 11 shows a program in ahigh level language 1102 may be compiled using an x86 compiler 1104 togenerate x86 binary code 1106 that may be natively executed by aprocessor with at least one x86 instruction set core 1116. The processorwith at least one x86 instruction set core 1116 represents any processorthat can perform substantially the same functions as an Intel processorwith at least one x86 instruction set core by compatibly executing orotherwise processing (1) a substantial portion of the instruction set ofthe Intel x86 instruction set core or (2) object code versions ofapplications or other software targeted to run on an Intel processorwith at least one x86 instruction set core, in order to achievesubstantially the same result as an Intel processor with at least onex86 instruction set core. The x86 compiler 1104 represents a compilerthat is operable to generate x86 binary code 1106 (e.g., object code)that can, with or without additional linkage processing, be executed onthe processor with at least one x86 instruction set core 1116.Similarly, FIG. 11 shows the program in the high level language 1102 maybe compiled using an alternative instruction set compiler 1108 togenerate alternative instruction set binary code 1110 that may benatively executed by a processor without at least one x86 instructionset core 1114 (e.g., a processor with cores that execute the MIPSinstruction set of MIPS Technologies of Sunnyvale, Calif. and/or thatexecute the ARM instruction set of ARM Holdings of Sunnyvale, Calif.).The instruction converter 1112 is used to convert the x86 binary code1106 into code that may be natively executed by the processor without anx86 instruction set core 1114. This converted code is not likely to bethe same as the alternative instruction set binary code 1110 because aninstruction converter capable of this is difficult to make; however, theconverted code will accomplish the general operation and be made up ofinstructions from the alternative instruction set. Thus, the instructionconverter 1112 represents software, firmware, hardware, or a combinationthereof that, through emulation, simulation or any other process, allowsa processor or other electronic device that does not have an x86instruction set processor or core to execute the x86 binary code 1106.

Method and Apparatus for a Vector Index Load and Store

The key feature of high performance code (HPC) is that it has asignificant number of memory references, most of which point to the samememory but with a different index. With current implementations, each ofthese memory indexes needs a “separate” general purpose register (e.g.,a GPR x86-64 in an x86 architecture). With a limited register set (e.g.,eight x86 and sixteen x64 registers) and with a large number of memoryreferences, the GPR register set soon fills up leading to spill-and-fillon the stack, and generating bloated and inefficient code. Moreover,these indexes need further computation such as add, multiply orsubtract, all of which require a GPR scalar computation, furtherconsuming the GPR register stack and creating unnecessary duplicate codebloat as the computations are the same across all of the indexes.

The embodiments of the invention include vector indexed load/storeinstructions which improve the performance of loads and stores by usinga SIMD vector register as the index register for each load/storeoperation. Using a vector register in this manner speeds up commutationof the index, which may be accomplished using a SIMD vector computerather than a GPR scalar compute, resulting in more compact andefficient code. The embodiments of the invention also naturally flowwithin a vectorized loop. Because all index computations are nowperformed in SIMD vector registers and do not need to be spilled on thestack and then read back for performing loads/stores, more efficientvectorization of HPC code loops can be achieved. In addition, theseembodiments are significantly easier for the compiler to vectorize(e.g., due to less management of the GPR stack).

One embodiment of the invention includes a 3-source vector index loadinstruction (VILD) and a 3-source vector index store instruction (VIST)which takes the following forms:

Vector Index Load: VILD[B/W/D/Q] DST_SIMD_REG {k1}{z}, [MEM+VectIndex],ImmSelectForVectIndex; and

Vector Index Store: VIST[B/W/D/Q] [MEM+VectIndex] {k1}{z}, SRC_SIMD_REG,ImmSelectForVectIndex, where:

→MEM is memory base reference,

→VectIndex is a SIMD vector register,

→ImmSelectForVectIndex is used for selecting the corresponding indexfrom the Vectorindex register, and

→B/W/D/Q indicates whether the instruction is performed using byte,word, doubleword, or quadword values.

FIG. 12 illustrates an exemplary processor 1255 on which embodiments ofthe invention may be implemented. In one embodiment, each core 0-N ofthe processor 1255 includes a memory management unit 1290 with vectorindex load/store logic 1291 for performing the vector index load/storeoperations described herein. In addition, each core 0-N includes a setof general purpose registers (GPRs) 1205, a set of vector registers1206, and a set of mask registers 1207. In one embodiment, multiplevector data elements are packed into each vector register 1206 which mayhave a 512 bit width for storing two 256 bit values, four 128 bitvalues, eight 64 bit values, sixteen 32 bit values, etc. However, theunderlying principles of the invention are not limited to any particularsize/type of vector data. In one embodiment, the mask registers 1207include eight 64-bit operand mask registers used for performing bitmasking operations on the values stored in the vector registers 1206(e.g., implemented as mask registers k0-k7 described above). However,the underlying principles of the invention are not limited to anyparticular mask register size/type.

The details of a single processor core (“Core 0”) are illustrated inFIG. 12 for simplicity. It will be understood, however, that each coreshown in FIG. 12 may have the same set of logic as Core 0. For example,each core may include a dedicated Level 1 (L1) cache 1212 and Level 2(L2) cache 1211 for caching instructions and data according to aspecified cache management policy. The L1 cache 1212 includes a separateinstruction cache 1220 for storing instructions and a separate datacache 1221 for storing data. The instructions and data stored within thevarious processor caches are managed at the granularity of cache lineswhich may be a fixed size (e.g., 64, 128, 512 Bytes in length). Eachcore of this exemplary embodiment has an instruction fetch unit 1210 forfetching instructions from main memory 1200 and/or a shared Level 3 (L3)cache 1216; a decode unit 1220 for decoding the instructions (e.g.,decoding program instructions into micro-operatons or “uops”); anexecution unit 1240 for executing the instructions; and a writeback unit1250 for retiring the instructions and writing back the results.

The instruction fetch unit 1210 includes various well known componentsincluding a next instruction pointer 1203 for storing the address of thenext instruction to be fetched from memory 1200 (or one of the caches);an instruction translation look-aside buffer (ITLB) 1204 for storing amap of recently used virtual-to-physical instruction addresses toimprove the speed of address translation; a branch prediction unit 1202for speculatively predicting instruction branch addresses; and branchtarget buffers (BTBs) 1201 for storing branch addresses and targetaddresses. Once fetched, instructions are then streamed to the remainingstages of the instruction pipeline including the decode unit 1230, theexecution unit 1240, and the writeback unit 1250. The structure andfunction of each of these units is well understood by those of ordinaryskill in the art and will not be described here in detail to avoidobscuring the pertinent aspects of the different embodiments of theinvention.

FIG. 13 illustrates one embodiment of the vector index load/store logic1291 which utilizes a vector index register 1301 for storing the sourceindex values i0-i7 and a destination/source vector register 1302 forstoring the vector loaded from memory 1200 in response to the vectorindex load instructions or stored to memory 1200 in response to thevector index store instructions. In one embodiment, thedestination/source vector register 1302 comprises a 512-bit vectorregister with eight 64-bit vector data elements (located at 63:0,127:64, 191:128, etc) and the vector index register 1301 comprises a512-bit vector register with eight 64-bit index values. A mask register1303 stores a mask value for performing write masking operations asdescribed herein. In one embodiment, the mask register 1303 is a 64-bitregister (e.g., such as the k0-k7 registers described above). A basememory reference 1304 is provided for combination with the indexes fromthe vector index register 1301 for calculating a memory address. Inaddition, a immediate select value 1305 is provided for identifying aparticular vector index from the vector index register 1301 to becombined with the base memory reference 1304 to calculate the finalmemory address. While various exemplary register sizes and data typesare mentioned above for the purpose of illustration, it should be notedthat the underlying principles of the invention are not limited to anyparticular size/type of index, mask, immediate value or data element.

In operation, a plurality of different indexes i0-i7 are stored withinthe vector index register 1301. The vector index load/store logic 1291identifies the index to be used for the current load/store operationfrom the immediate value 1305. In one embodiment, the immediate value1305 comprises a value between 0 and N−1 to identify N different indexvalues are stored within the vector index register 1301 (in FIG. 13,N=8). Once the vector index load/store logic 1291 identifies theappropriate index, it combines the index with the base memory reference1304 to calculate the memory address for the load/store operation. Itthen performs the load/store using the destination/source vectorregister 1302, loading values from memory to data element locationswithin the vector register 1302 or storing values from the data elementlocations of the vector register 1302 to memory. In one embodiment, amask value from the mask register 1303 is used to specify the number ofelements to be loaded/stored from/to the given memory address.

FIG. 14 illustrates a specific example in which double precisionfloating point values (64 bits each) are to be loaded from memory, whereStruct Atom [double x, y, z] and Atom AtomArray [10000]. In thisexample, MEM points to base of the array, i.e., & AtomArray [0].VectIndex is a ZMM1 register 1301 containing eight values as memoryindexes (DWORD value): ZMM1={7000, 6000, 4000, 3000, 900, 500, 2000,1000}. Mask k1 1303=binary 00000111 indicating that the elements x, y,and z are to be loaded at the given index (as indicated by the three setbits 111 in the LSB locations). In the illustrated example, it isassumed that index 2000 identifies the data to be loaded, which isstored in the second element of the ZMM1 register (element 1).Consequently, to load Atom elements x, y, z from index 2000 ofAtomArray, the instruction VILD ZMM2 {k1}, [MEM+ZMM1], 1 may beexecuted. The result of the load operation is that the destinationvector register 1302, ZMM2={0,0,0,0,0, AtomArray[2000].z,AtomArray[2000].y, AtomArray[2000].x}.

A method in accordance with one embodiment of the invention isillustrated in FIG. 15. The method may be executed within the context ofthe architectures described above, but is not limited to any specificsystem architectures.

At 1501, a vector index load instruction is fetched from memory or readfrom a cache (e.g., an L1, L2, or L3 cache). At 1502, index values arestored in the source vector index register. At 1503, the index to becombined with the base memory address is identified within the vectorindex register using the immediate value included with the vector indexload instruction. At 1504, the index is combined with the base memoryreference to determine the memory address for the load operation.Finally, at 1505, the data identified by the memory address is loadedfrom memory (e.g., such as the array data mentioned above).

A method in accordance with one embodiment of the invention isillustrated in FIG. 16. The method may be executed within the context ofthe architectures described above, but is not limited to any specificsystem architectures.

At 1601, a vector index store instruction is fetched from memory or readfrom a cache (e.g., an L1, L2, or L3 cache). At 1602, index values arestored in the source vector index register. At 1603, the index to becombined with the base memory address is identified within the vectorindex register using the immediate value included with the vector indexstore instruction. At 1604, the index is combined with the base memoryreference to determine the memory address for the store operation.Finally, at 1605, the data is stored to memory at the memory address.

As mentioned above, high performance code (HPC) has a significant numberof memory references wherein the base memory address is the same but theindexes are different. Further, the indexes are generally computed andthe values stored and maintained in the SIMD vector registers. Theembodiments of the invention take advantage of maintaining and re-usingthe indexes in the SIMD vector registers to do the loads and storeswithout performing spill-to-mem and/or fill-to-GPR register operations.

By way of example, consider the following application use-case, which isa snapshot of a C code-sequence from a HPC application operating on adouble precision data-set:

if (delr2 >= lowest_efs_u) { //FP Double-Precision data-set  ind =(int)(dens_efs * delr2);  ind = ind << 2;  // ! 4 * ind  df = cgi_cgj *(f_tbl[ind] + du * f_tbl[1 + ind] + du2 * f_tbl[2 + ind] +  du3 *f_tbl[3 + ind]);  ... } else {  delr = sqrt(delr2);  delrinv = 1.0 /delr;  x = (*dxdr) * (delr);  ind = (int)(*eedtbdns_stk * x);  dx = x −(double)(ind) * (*del);  ind = ind<<2;// ! 4 * ind  e3dx = dx *eed_cub[2 + ind];  e4dx2 = dx * dx * eed_cub[3 + ind];  Switch =eed_cub[ind] + dx * (eed_cub[1 + ind] + half * (e3dx +  third * e4dx2)); ... }

The above program code loads 4 elements from f_tbl or from eed_cubdepending on whether there is an “if” or “else” condition, respectively.Further, computation of the indexes (i.e., “ind”) comes out naturally ina vector SIMD register as the loop is vectorized.

Taking a simple case, suppose that the “if” condition was true for thevectorized loop. In that case, all 8 indexes “ind” are in the SIMDvector register. Since only four elements at the given index are to beloaded, the mask is set to 0x00001111. Note that the mask values andbase address register pointing to the f_tbl is constant for all of these8 loads. Thus, the only difference is the indexes.

In contrast, with current ISA implementations, in order to perform 8vector loads of “f_tbl” array, the SIMD register has to be spilled tomemory and the index values read from there. This results in bloatedcode, resulting in further spill-fill of general purpose registers(e.g., x86-64 GPR registers) if they are being used elsewhere, resultingin slow code.

The embodiments of the invention for performing vector index load/storesolves this problem by re-using the index values in the SIMD register asit is to perform the load/store. This results in efficient, compactfully SIMD code besides being much more readable. This feature is alsosimilar to SIMD index registers being used for gathers and scatters butextends it to vanilla loads and stores.

The following example will help to highlight the benefits of theembodiments of the invention described herein:

Struct Atom [double x, y, z];

Atom AtomArray [10000];

1. Memory is defined as:

Struct Table [double x, y, z,w];

Table f_tbl [10000];

2. Indexes computed are held in the ZMM register in accordance with oneembodiment of the invention, as shown in Table 1 below, and thecorresponding values are illustrated for an implementation which usesthe x86-64 GPR registers.

TABLE 1 GPR r15 r14 r13 r12 r11 r10 r9 r8 ZMM 7000 6000 4000 3000 90005000 2000 1000

It is assumed that mask K1 is set to 0x0F to load the four elements x,y, z, and w.

Using a current ISA implementations, eight vector loads are performed inregisters ZMM1-8 as follows:

VMOVDQA ZMM1 {k1}, [MEM+r8]

VMOVDQA ZMM2 {k1}, [MEM+r9]

VMOVDQA ZMM3 {k1}, [MEM+r10]

VMOVDQA ZMM4 {k1}, [MEM+r11]

VMOVDQA ZMM5 {k1}, [MEM+r12]

VMOVDQA ZMM6 {k1}, [MEM+r13]

VMOVDQA ZMM7 {k1}, [MEM+r14]

VMOVDQA ZMM8 {k1}, [MEM+r15]

With the embodiments of the invention using vector-indexed loads, theindexes may be stored in one or more ZMM registers (e.g., ZMM15 in thebelow example). Using the above-described instruction format, thecorresponding vector indexed loads may be performed with the followinginstruction sequence (assuming quadword (Q) values):

VILDQ ZMM1 {k1}, [MEM+ZMM15], 0

VILDQ ZMM2 {k1}, [MEM+ZMM15], 1

VILDQ ZMM3 {k1}, [MEM+ZMM15], 2

VILDQ ZMM4 {k1}, [MEM+ZMM15], 3

VILDQ ZMM5 {k1}, [MEM+ZMM15], 4

VILDQ ZMM6 {k1}, [MEM+ZMM15], 5

VILDQ ZMM7 {k1}, [MEM+ZMM15], 6

VILDQ ZMM8 {k1}, [MEM+ZMM15], 7

A similar instruction sequence may be performed for store operationsusing VIST. Note that for the above VILD instructions (and for VISTinstructions), no GPR register need be involved when retrieving indexvalues.

In the foregoing specification, the embodiments of invention have beendescribed with reference to specific exemplary embodiments thereof. Itwill, however, be evident that various modifications and changes may bemade thereto without departing from the broader spirit and scope of theinvention as set forth in the appended claims. The specification anddrawings are, accordingly, to be regarded in an illustrative rather thana restrictive sense.

Embodiments of the invention may include various steps, which have beendescribed above. The steps may be embodied in machine-executableinstructions which may be used to cause a general-purpose orspecial-purpose processor to perform the steps. Alternatively, thesesteps may be performed by specific hardware components that containhardwired logic for performing the steps, or by any combination ofprogrammed computer components and custom hardware components.

As described herein, instructions may refer to specific configurationsof hardware such as application specific integrated circuits (ASICs)configured to perform certain operations or having a predeterminedfunctionality or software instructions stored in memory embodied in anon-transitory computer readable medium. Thus, the techniques shown inthe Figures can be implemented using code and data stored and executedon one or more electronic devices (e.g., an end station, a networkelement, etc.). Such electronic devices store and communicate(internally and/or with other electronic devices over a network) codeand data using computer machine-readable media, such as non-transitorycomputer machine-readable storage media (e.g., magnetic disks; opticaldisks; random access memory; read only memory; flash memory devices;phase-change memory) and transitory computer machine-readablecommunication media (e.g., electrical, optical, acoustical or other formof propagated signals—such as carrier waves, infrared signals, digitalsignals, etc.). In addition, such electronic devices typically include aset of one or more processors coupled to one or more other components,such as one or more storage devices (non-transitory machine-readablestorage media), user input/output devices (e.g., a keyboard, atouchscreen, and/or a display), and network connections. The coupling ofthe set of processors and other components is typically through one ormore busses and bridges (also termed as bus controllers). The storagedevice and signals carrying the network traffic respectively representone or more machine-readable storage media and machine-readablecommunication media. Thus, the storage device of a given electronicdevice typically stores code and/or data for execution on the set of oneor more processors of that electronic device. Of course, one or moreparts of an embodiment of the invention may be implemented usingdifferent combinations of software, firmware, and/or hardware.Throughout this detailed description, for the purposes of explanation,numerous specific details were set forth in order to provide a thoroughunderstanding of the present invention. It will be apparent, however, toone skilled in the art that the invention may be practiced without someof these specific details. In certain instances, well known structuresand functions were not described in elaborate detail in order to avoidobscuring the subject matter of the present invention. Accordingly, thescope and spirit of the invention should be judged in terms of theclaims which follow.

What is claimed is:
 1. A processor comprising: a vector index registerto store a plurality of index values; a mask register to store aplurality of mask bits; a vector register to store a plurality of vectordata elements loaded from memory; and vector index load logic toidentify an index stored in the vector index register to be used for aload operation using an immediate value and to responsively combine theindex with a base memory address to determine a memory address for theload operation, the vector index load logic to load vector data elementsfrom the memory address to the vector register in accordance with theplurality of mask bits.
 2. The processor as in claim 1 wherein theplurality of mask bits are to indicate a number of vector data elementsto be loaded from the memory address.
 3. The processor as in claim 1wherein the mask register comprises a 64-bit mask register and whereinthe vector index register and vector register comprise 512-bit vectorregisters having eight 64-bit values.
 4. The processor as in claim 1wherein the immediate value comprises an integer value identifying anindex position for an index within the vector index register.
 5. Theprocessor as in claim 1 further comprising: a memory management unit tocompute each of the index values and store the index values within thevector index register.
 6. The processor as in claim 1 wherein the vectordata elements comprise double-precision floating point values.
 7. Theprocessor as in claim 1 wherein a data array comprising the vector dataelements is to be stored in memory and wherein the base memory addresspoints to the base of the array, the vector index load logic to combinethe base memory address with each of the index values to identify eachof the vector data elements in the array.
 8. The processor as in claim 1wherein identifying an index, combining the index with a base memoryaddress, and loading the vector data elements are performed responsiveto decoding and execution of a vector index load instruction.
 9. Theprocessor as in claim 1 wherein the vector index load instruction isdecoded into a plurality of microoperations.
 10. A processor comprising:a vector index register to store a plurality of index values; a maskregister to store a plurality of mask bits; a vector register to store aplurality of vector data elements to be stored to memory; and vectorindex store logic to identify an index stored in the vector indexregister to be used for a store operation using an immediate value andto responsively combine the index with a base memory address todetermine a memory address for the store operation, the vector indexload logic to store vector data elements from the vector register to thememory address in a system memory in accordance with the plurality ofmask bits.
 11. The processor as in claim 10 wherein the plurality ofmask bits are to indicate a number of vector data elements to be storedto the memory address.
 12. The processor as in claim 10 wherein the maskregister comprises a 64-bit mask register and wherein the vector indexregister and vector register comprise 512-bit vector registers havingeight 64-bit values.
 13. The processor as in claim 10 wherein theimmediate value comprises an integer value identifying an index positionfor an index within the vector index register.
 14. The processor as inclaim 10 further comprising: a memory management unit to compute each ofthe index values and store the index values within the vector indexregister.
 15. The processor as in claim 10 wherein the vector dataelements comprise double-precision floating point values.
 16. Theprocessor as in claim 10 wherein a data array comprising the vector dataelements is to be stored in memory and wherein the base memory addresspoints to the base of the array, the vector index store logic to combinethe base memory address with each of the index values to identify alocation to store each of the vector data elements in the array.
 17. Theprocessor as in claim 10 wherein identifying an index, combining theindex with a base memory address, and storing the vector data elementsare performed responsive to decoding and execution of a vector indexload instruction.
 18. The processor as in claim 17 wherein the vectorindex load instruction is decoded into a plurality of microoperations.19. A method comprising: storing a plurality of index values in a vectorindex register; storing a plurality of mask bits in a mask register;storing a plurality of vector data elements loaded from memory; andidentifying an index stored in the vector index register to be used fora load operation using an immediate value; responsively combining theindex with a base memory address to determine a memory address for theload operation; and loading vector data elements from the memory addressto the vector register in accordance with the plurality of mask bits.20. The method as in claim 19 wherein the plurality of mask bits are toindicate a number of vector data elements to be loaded from the memoryaddress.
 21. The method as in claim 19 wherein the mask registercomprises a 64-bit mask register and wherein the vector index registerand vector register comprise 512-bit vector registers having eight64-bit values.
 22. The method as in claim 19 wherein the immediate valuecomprises an integer value identifying an index position for an indexwithin the vector index register.
 23. The method as in claim 19 furthercomprising: a memory management unit to compute each of the index valuesand store the index values within the vector index register.
 24. Themethod as in claim 19 wherein the vector data elements comprisedouble-precision floating point values.
 25. The method as in claim 19further comprising: storing a data array comprising the vector dataelements in memory, wherein the base memory address points to the baseof the array; and combining the base memory address with each of theindex values to identify each of the vector data elements in the array.26. The method as in claim 19 wherein identifying an index, combiningthe index with a base memory address, and loading the vector dataelements are performed responsive to decoding and execution of a vectorindex load instruction.
 27. The method as in claim 26 wherein the vectorindex load instruction is decoded into a plurality of microoperations.